Approximate counting with m counters: A probabilistic analysis
نویسندگان
چکیده
منابع مشابه
Approximate counting with m counters: a probabilistic analysis
Motivated by a recent paper by Cichoń and Macyna [1], who introduced m counters (instead of just one) in the approximate counting scheme first analysed by Flajolet [2], we analyse the moments of the sum of the m counters, using techniques that proved to be successful already in several other contexts [11].
متن کاملApproximate counting with m counters: A detailed analysis
The classical algorithm approximate counting was recently modified by Cichon and Macyna: Instead of one counter, m counters are used, and the assignment of an incoming item to one of the counters is random. The parameter of interest is the sum of the values of all the counters. We analyse expectation and variance, getting explicit and asymptotic formulæ.
متن کاملCount-Min-Log sketch: Approximately counting with approximate counters
Count-Min Sketch [1] is a widely adopted algorithm for approximate event counting in large scale processing. However, the original version of the Count-Min-Sketch (CMS) suffers of some deficiences, especially if one is interested in the low-frequency items, such as in textmining related tasks. Several variants of CMS [5] have been proposed to compensate for the high relative error for low-frequ...
متن کاملApproximate Probabilistic Inference via Word-Level Counting
Probabilistic inference on large and uncertain data sets is increasingly being used in a wide range of applications. It is well-known that probabilistic inference is polynomially inter-reducible to model counting (Roth 1996). In a recent line of work, it has been shown (Chakraborty, Meel, and Vardi 2013; Chakraborty et al. 2014; Ermon et al. 2014; Ermon et al. 2013) that one can strike a fine b...
متن کاملApproximate Counting: A Detailed Analysis
Approximate counting is an algorithm proposed by R. Morris which makes it possible to keep approximate counts of large numbers in small counters. The algorithm is useful for gathering statistics of a large number of events as well as for applications related to data compression (Todd et al.). We provide here a complete analysis of approximate counting which establishes good convergence properti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra Combinatorics Discrete Structures and Applications
سال: 2015
ISSN: 2148-838X
DOI: 10.13069/jacodesmath.36015